Redesigning Subgroups in a Personnel Network Based on Dna Computing

Employees’ tasks have been changing according to the current times by technical development and reform in complicated human relationships, and their capabilities and abilities are also continuing to improve. Therefore, the necessity for a competent rating to qualitatively understand relations between employees arises. In this paper, we select a model of a workplace where employees are sharing information from a variety of workplaces, and we suppose a personnel network which contains their relations in terms of mutual understanding. Some subgroups are sure to exist in this employee personnel network, and the personnel network can be improved by redesigning all the cliques of subgroup networks. However, with a huge number of employees it becomes extremely hard to find the maximum clique in the personnel network, meaning this problem is NP-hard. All cohesive subgroups can be found by making the best use of DNA-based computing, also known as molecular computation, which is a new approach to massively parallel computation. DNA computing is drawing attention from many researchers around the world. The goal of this paper is to propose a way to apply DNA computing, one of the new biotechnologies, to human resource management that is a part of the management engineering field, and to measure the efficiency of DNA computing in redesigning subgroups to support work rotation.